Joint distribution of sojourn time and queue length in the M/G/1 queue with (in) finite capacity
نویسندگان
چکیده
منابع مشابه
Sojourn time asymptotics in the MG1 processor sharing queue
We show for the M/G/1 processor sharing queue that the service time distribution is regularly varying of index −ν, ν non-integer, iff the sojourn time distribution is regularly varying of index −ν. This result is derived from a new expression for the Laplace–Stieltjes transform of the sojourn time distribution. That expression also leads to other new properties for the sojourn time distribution...
متن کاملA Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملLoss probability in a finite queue with service interruptions and queue length distribution in the corresponding infinite queue
In this paper, we consider a discrete-time finite-buffer queue with correlated arrivals and service interruptions and the corresponding infinite-buffer queue. Under some assumptions, we derive an exact relation holding between the loss probability in the finite-buffer queue and the queue length distribution in the corresponding infinite-buffer queue. The exact relation is considered as an integ...
متن کاملOn sojourn times in the finite capacity M/M/1 queue with processor sharing
We consider a processor shared M/M/1 queue that can accommodate at most a finite number K of customers. We give an exact expression for the sojourn time distribution in the finite capacity model, in terms of a Laplace transform. We then give the tail behavior, for the limit K → ∞, by locating the dominant singularity of the Laplace transform. keywords: finite capacity, processor sharing, sojour...
متن کاملCommuting matrices in the queue length and sojourn time analysis of MAP/MAP/1 queues
Queues with Markovian arrival and service processes, i.e., MAP/MAP/1 queues, have been useful in the analysis of computer and communication systems and di erent representations for their stationary sojourn time and queue length distribution have been derived. More speci cally, the class of MAP/MAP/1 queues lies at the intersection of the class of QBD queues and the class of semi-Markovian queue...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1984
ISSN: 0377-2217
DOI: 10.1016/0377-2217(84)90078-x